See time-constructible function on Wiktionary
{
"forms": [
{
"form": "time-constructible functions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "time-constructible function (countable and uncountable, plural time-constructible functions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
}
],
"glosses": [
"A function f from natural numbers to natural numbers with the property that f(n) can be constructed from n by a Turing machine in the time of order f(n), whose purpose of such a definition is to exclude functions that do not provide an upper bound on the runtime of some Turing machine."
],
"id": "en-time-constructible_function-en-noun-S218lHpy",
"links": [
[
"natural number",
"natural number"
],
[
"property",
"property"
],
[
"construct",
"construct"
],
[
"Turing machine",
"Turing machine"
],
[
"purpose",
"purpose"
],
[
"definition",
"definition"
],
[
"exclude",
"exclude"
],
[
"function",
"function"
],
[
"provide",
"provide"
],
[
"upper bound",
"upper bound"
],
[
"runtime",
"runtime"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computational complexity theory) A function f from natural numbers to natural numbers with the property that f(n) can be constructed from n by a Turing machine in the time of order f(n), whose purpose of such a definition is to exclude functions that do not provide an upper bound on the runtime of some Turing machine."
],
"tags": [
"countable",
"uncountable"
]
}
],
"word": "time-constructible function"
}
{
"forms": [
{
"form": "time-constructible functions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "time-constructible function (countable and uncountable, plural time-constructible functions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries"
],
"glosses": [
"A function f from natural numbers to natural numbers with the property that f(n) can be constructed from n by a Turing machine in the time of order f(n), whose purpose of such a definition is to exclude functions that do not provide an upper bound on the runtime of some Turing machine."
],
"links": [
[
"natural number",
"natural number"
],
[
"property",
"property"
],
[
"construct",
"construct"
],
[
"Turing machine",
"Turing machine"
],
[
"purpose",
"purpose"
],
[
"definition",
"definition"
],
[
"exclude",
"exclude"
],
[
"function",
"function"
],
[
"provide",
"provide"
],
[
"upper bound",
"upper bound"
],
[
"runtime",
"runtime"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computational complexity theory) A function f from natural numbers to natural numbers with the property that f(n) can be constructed from n by a Turing machine in the time of order f(n), whose purpose of such a definition is to exclude functions that do not provide an upper bound on the runtime of some Turing machine."
],
"tags": [
"countable",
"uncountable"
]
}
],
"word": "time-constructible function"
}
Download raw JSONL data for time-constructible function meaning in All languages combined (1.6kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.